منابع مشابه
Codes from Hall planes of even order
We show that the binary code C of the projective Hall plane Hq2 of even order q where q = 2, for t ≥ 2 has words of weight 2q in its hull that are not the difference of the incidence vectors of two lines of Hq2 ; together with an earlier result for the dual Hall planes of even order, this shows that for all t ≥ 2 the Hall plane and its dual are not tame. We also deduce that dim(C) > 3+1, the di...
متن کاملInversive Planes of Even Order
1. Results. An inversive plane is an incidence structure of points and circles satisfying the following axioms: I. Three distinct points are connected by exactly one circle. II. If P, Q are two points and c a circle through P but not Q, then there is exactly one circle c' through P and Q such that cC\c'~ [P]. III. There are at least two circles. Every circle has at least three points. For any p...
متن کاملTransitive Arcs in Planes of Even Order
When one considers the hyperovals in PG (2 , q ) , q even , q . 2 , then the hyperoval in PG (2 , 4) and the Lunelli – Sce hyperoval in PG (2 , 16) are the only hyperovals stabilized by a transitive projective group [10] . In both cases , this group is an irreducible group fixing no triangle in the plane of the hyperoval , nor in a cubic extension of that plane . Using Hartley’s classification ...
متن کاملNew Flag-Transitive Affine Planes of Even Order
At least [6 n&1 1 (q i+1)] qn 2m1 log2 q of these planes have kernel GF(q). Moreover, we construct 7(mi)6i q mi planes, where the sum is over all sequences (mi) behaving as in the theorem; and then we settle the isomorphism problem for these planes (Theorem 5.2). The proof combines methods in [Wi] and [Ka]: these planes arise from symplectic and orthogonal spreads combined with changing from fi...
متن کاملGraphs for Orthogonal Arrays and Projective Planes of Even Order
We consider orthogonal arrays of strength two and even order q having n columns which are equivalent to n − 2 mutually orthogonal Latin squares of order q. We show that such structures induce graphs on n vertices, invariant up to complementation. Previous methods worked only for single Latin squares of even order and were harder to apply. If q is divisible by four the invariant graph is simple ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1974
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1974.55.543